(0) Obligation:
JBC Problem based on JBC Program:
Manifest-Version: 1.0
Created-By: 1.6.0_16 (Sun Microsystems Inc.)
Main-Class: FactSum
public class FactSum {
public static int factorial(int n){
if (n <=0) return 1;
else return n*factorial(n-1);
}
public static int doSum(int n){
int s=0;
while (n >= 0) {
s = s + factorial(n);
n=n-1;
}
return s;
}
public static void main(String[] args) {
doSum(10);
}
}
(1) JBC2FIG (SOUND transformation)
Constructed FIGraph.
(2) Obligation:
FIGraph based on JBC Program:
FactSum.main([Ljava/lang/String;)V: Graph of 684 nodes with 0 SCCs.
(3) FIGtoITRSProof (SOUND transformation)
Transformed FIGraph SCCs to IDPs. Logs:
(4) TRUE